Decoding of Subspace Codes, a Problem of Schubert Calculus over Finite Fields
نویسندگان
چکیده
Schubert calculus provides algebraic tools to solve enumerative problems. There have been several applied problems in systems theory, linear algebra and physics which were studied by means of Schubert calculus. The method is most powerful when the base field is algebraically closed. In this article we first review some of the successes Schubert calculus had in the past. Then we show how the problem of decoding of subspace codes used in random network coding can be formulated as a problem in Schubert calculus. Since for this application the base field has to be assumed to be a finite field new techniques will have to be developed in the future.
منابع مشابه
Geometric decoding of subspace codes with explicit Schubert calculus applied to spread codes
This article is about a decoding algorithm for error-correcting subspace codes. A version of this algorithm was previously described by Rosenthal, Silberstein and Trautmann [17]. The decoding algorithm requires the code to be defined as the intersection of the Plücker embedding of the Grassmannian and an algebraic variety. We call such codes geometric subspace codes. Complexity is substantially...
متن کاملIsotropic Constant Dimension Subspace Codes
In network code setting, a constant dimension code is a set of k-dimensional subspaces of F nq . If F_q n is a nondegenerated symlectic vector space with bilinear form f, an isotropic subspace U of F n q is a subspace that for all x, y ∈ U, f(x, y) = 0. We introduce isotropic subspace codes simply as a set of isotropic subspaces and show how the isotropic property use in decoding process, then...
متن کاملOn Skew Cyclic Codes over a Finite Ring
In this paper, we classify the skew cyclic codes over Fp + vF_p + v^2F_p, where p is a prime number and v^3 = v. Each skew cyclic code is a F_p+vF_p+v^2F_p-submodule of the (F_p+vF_p+v^2F_p)[x;alpha], where v^3 = v and alpha(v) = -v. Also, we give an explicit forms for the generator of these codes. Moreover, an algorithm of encoding and decoding for these codes is presented.
متن کاملCombinatorial Bounds for List Decoding of Subspace Codes
Abstract—Codes constructed as subsets of the projective geometry of a vector space over a finite field have recently been shown to have applications as random network error correcting codes. If the dimension of each codeword is restricted to a fixed integer, the code forms a subset of a finite-field Grassmannian, or equivalently, a subset of the vertices of the corresponding Grassmannian graph....
متن کاملD. Augot - Connections between decoding Reed-Solomon codes and solving discrete logarithms over extension fields
Joint work wih Francois Morain. A connection between the discrete logarithm problem over Fq^h and the problem of decoding Reed-Solomon codes over Fq has been proposed and studied by Cheng, Wang at FOCS 2004, essentially in a theoretical manner to study the hardness of decoding a ReedSolomon codes when a large number of errors occurs. We propose to study this reduction in a reverse direction fro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1209.2887 شماره
صفحات -
تاریخ انتشار 2012